Scheduling in Input Queued Switches: A Survey
نویسنده
چکیده
Current technology trends make it feasible to build extrememly high band-width connection networks. Development of high performance and cost-eeective switches is of paramount importance in such networks, and is an area of heavy current research. Two most important components of modern switches are queueing and scheduling. This paper presents a brief survey of unicast and multicast scheduling algorithms in input queued switches, with an emphasis on nonblocking, crossbar based, space-division packet switches.
منابع مشابه
Packet Scheduling in Input-Queued Cell-Based Switches
Input-queued switch architectures play a major role in the design of high performance switches and routers for packet networks. These architectures must be controlled by a scheduling algorithm, which solves contentions in the transfer of data units from inputs to outputs. Several scheduling algorithms were proposed in the literature for input-queued cell switches, operating on fixed-size data u...
متن کاملStable local scheduling policies in networks of input-queued switches
Most research on switch architectures and scheduling algorithms has focused on single switches. It is well known that certain scheduling policies that are based on maximum weight matching algorithms guarantee the stability of single switches. However, recent research has shown that most of these scheduling policies do not guarantee the stability of networks of input-queued switches. So far, onl...
متن کاملInput-queued router architectures exploiting cell-based switching fabrics
Input queued and combined input/output-queued architectures have recently come to play a major role in the design of high-performance switches and routers for packet networks. These architectures must be controlled by a packet scheduling algorithm, which solves contentions in the transfer of data units to switch outputs. Several scheduling algorithms were proposed in the literature for switches...
متن کاملIntegrated Scheduling and Buffer Management Scheme for Input Queued Switches under Extreme Traffic Conditions
This paper addresses scheduling and memory management in input queued switches having finite buffer space to improve the performance in terms of throughput and average delay. Most of the prior works on scheduling related to input queued switches assume infinite buffer space. In practice, buffer space being a finite resource, special memory management scheme becomes essential. We introduce a buf...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996